Separability by semivalues modified for games with coalition structure
نویسندگان
چکیده
Two games are inseparable by semivalues if both games obtain the same allocation whatever semivalue is considered. The problem of separability by semivalues reduces to separability from the null game. For four or more players, the vector subspace of games inseparable from the null game by semivalues contains games different to zero-game. Now, for five or more players, the consideration of a priori coalition blocks in the player set allows us to reduce in a significant way the dimension of the vector subspace of games inseparable from the null game. For these subspaces we provide basis formed by games of a particular type.
منابع مشابه
Cooperative games with a priori unions: introduction of a wide set of solutions
The semivalues are solution concepts for cooperative games that assign to each player a weighted sum of his/her marginal contributions to the coalitions, where the weights only depend on the coalition size. The Shapley value and the Banzhaf value are semivalues. The solutions introduced here are modifications of the semivalues when we consider a priori coalition blocks in the player set. A firs...
متن کاملA modified position value for communication situations and its fuzzification
Myerson treated various situations of cooperation in the field of cooperative games and proposed the communication structure. In this paper, we define and characterize an allocation rule in terms of the position value, called an average spanning tree solution, for communication situations by introducing a concept of cooperation relationship which says that two players are deemed to possess this...
متن کاملAxiomatic characterizations of the symmetric coalitional binomial semivalues
The symmetric coalitional binomial semivalues extend the notion of binomial semivalue to games with a coalition structure, in such a way that they generalize the symmetric coalitional Banzhaf value. By considering the property of balanced contributions within unions, two axiomatic characterizations for each one of these values are provided.
متن کاملGeneralized additive games
A Transferable Utility (TU) game with n players specifies a vector of 2 − 1 real numbers, i.e. a number for each non-empty coalition, and this can be difficult to handle for large n. Therefore, several models from the literature focus on interaction situations which are characterized by a compact representation of a TU-game, and such that the worth of each coalition can be easily computed. Some...
متن کاملOn cooperative games, inseparable by semivalues
Semivalues like the Shapley value and the Banzhaf value may assign the same payoff vector to different games. It is even possible that two games attain the same outcome for all semivalues. Due to the linearity of the semivalues, this exactly occurs in case the difference of the two games is an element of the kernel of each semivalue. The intersection of these kernels is called the shared kernel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RAIRO - Operations Research
دوره 43 شماره
صفحات -
تاریخ انتشار 2009